Inclusion of regular and linear languages in group languages
نویسنده
چکیده
Let Σ = X ∪ X = {x1, x2, ..., xm, x −1 1 , x 2 , ..., x m } and let G be a group with set of generators Σ. Let L(G) = {ω ∈ Σ∗ | ω ≡ e (mod G)} ⊆ Σ∗ be the group language representing G, where Σ∗ is a free monoid over Σ and e is the identity in G. The problem of determining whether a context-free language is subset of a group language is discussed. Polynomial algorithms are presented for testing whether a regular language, or a linear language is included in a group language. A few finite sets are built, such that each of them is included in the group language L(G) if and only if the respective context-free language is included in L(G).
منابع مشابه
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملExploring Effects and Learner Attitudes of Gadget-Based Internet Multimedia Reading
This mixed-methods study aimed at investigating the effects of a gadget-based Internet multimedia extensive reading program on promoting language proficiency. In so doing, a pretest-posttest design was applied in the quantitative phase to comparatively analyze outcomes of three classes of college-level EFL learners (two experimental groups and one control, each including 30 university students)...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1312.0190 شماره
صفحات -
تاریخ انتشار 2013